On the computational complexity of dynamic slicing problems for program schemas
نویسندگان
چکیده
منابع مشابه
On the computational complexity of dynamic slicing problems for program schemas
On the computational complexity of dynamic slicing problems for program schemas SEBASTIAN DANICIC†§, ROBERT. M. HIERONS‡ and MICHAEL R. LAURENCE† †Department of Computing, Goldsmiths College, University of London, London SE14 6NW, United Kingdom Email: [email protected] ‡Department of Information Systems and Computing, Brunel University, Middlesex, UB8 3PH, United Kingdom Email: rob.hierons@...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولComputational Complexity of Dynamic Problems
This progress report surveys some of my scientiic work on part A of the Ph.D.-programme at the Computer Science Department of the University of Aarhus. I give a survey-like introduction to the eld of Complexity Theory to which my results bear relevance. I give a general account of my contributions to the eld, including the the Dynamic Transitive Closure Problem for spherical st-graphs, the Dyna...
متن کاملOn the Computational Complexity of Dynamic Graph Problems
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh A common way to evaluate the time complexity of an algorithm is to use asymptotic worst-case analysis and to express the cost of the computation as a function of the size of the input. However, for an incremental algorithm this kind of analysis is sometimes not very informative. (By an “incremental algorithm...
متن کاملDynamic program slicing methods
A dynamic program slice is this part of a program that "affects" the computation of a variable of interest during program execution on a specific program input. Dynamic program slicing refers to a collection of program slicing methods that are based on program execution and may significantly reduce the size of a program slice because run-time information, collected during program execution, is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2011
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129511000223